//
// Created by Lenovo on 2020/10/21.
//

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define ll long long
#define debug(x) cout<<#x<<": "<<x<<endl
const int maxn =55;
ll gcd(ll x,ll y)
{
    return y?gcd(y,x%y):x;
}
ll lcm(ll x,ll y)
{
    return x/gcd(x,y)*y;
}
ll a[maxn];
int main()
{
    int n;
    cin>>n;
    for(int i = 1;i<=n;i++)
    {
        cin>>a[i];
    }
    ll x;
    cin>>x;
    int flag = 0;
    ll ans = 1;
    for(int i = 1;i<=n;i++)
    {
        if(x%a[i]==0)
        {
            ans = lcm(ans,a[i]);
            if(ans==x)
            {
                flag = 1;
                break;
            }
        }
    }
    if(flag) puts("Possible");
    else puts("Impossible");
}
